#include "Traversal.h"
void Test1()
{
    BinaryTree* node1 = BinaryTreeCreate(1);
    BinaryTree* node2 = BinaryTreeCreate(2);
    BinaryTree* node3 = BinaryTreeCreate(3);
    BinaryTree* node4 = BinaryTreeCreate(4);
    BinaryTree* node5 = BinaryTreeCreate(5);
    BinaryTree* node6 = BinaryTreeCreate(6);
    node1->left = node2;
    node1->right = node4;
    node2->left = node3;
    node4->left = node5;
    node4->right = node6;
//    PreOrderTraversal(node1);
//    printf("总节点为%d\n", BinaryTreeSize(node1));
//    printf("叶子结点个数为%d\n", TreeLeafsSize(node1));
//    printf("第%d层的结点个数是%d\n", 3,TreeKSize(node1,3));
//    BinaryTree *find = BinaryTreeFind(node1,6);
//    if(find == NULL)
//        printf("没找到\n");
//    else
//    printf("找到了\n");
//    int high = TreeHigh(node1);
//    printf("树的深度是:%d\n",high);
}
int main()
{
    Test1();
}